Entropic measures, Markov information sources and complexity
نویسندگان
چکیده
منابع مشابه
Entropic measures, Markov information sources and complexity
The concept of entropy plays a major part in communication theory. The Shannon entropy is a measure of uncertainty with respect to a priori probability distribution. In algorithmic information theory the information content of a message is measured in terms of the size in bits of the smallest program for computing that message. This paper discusses the classical entropy and entropy rate for dis...
متن کاملEntropic-based Similarity and Complexity Measures of 2d Archtectural Drawings
In this paper we construct an information-theoretic model of architectural drawings. This model is then used to quantify and measure the complexities and similarities of drawings. The approach is applied within a linear qualitative shape representation but can be generalized to other types of representation. The descriptive and analytic power of the proposed methods are demonstrated by studying...
متن کاملJoint String Complexity for Markov Sources
String complexity is defined as the cardinality of a set of all distinct words (factors) of a given string. For two strings, we define joint string complexity as the set of words that are common to both strings. We also relax this definition and introduce joint semi-complexity restricted to the common words appearing at least twice in both strings. String complexity finds a number of applicatio...
متن کاملInformation Geometric Complexity of Entropic Motion on Curved Statistical Manifolds
It is known that the concept of complexity is very difficult to define and its origin is not fully understood. It is mainly for this reason that several quantitative measures of complexity have appeared in the scientific literature [1]. In particular, while our current knowledge of the relations between complexity, dynamical stability, and chaoticity is not satisfactory in a fully quantum domai...
متن کاملPermutation Complexity and Coupling Measures in Hidden Markov Models
In [Haruna, T. and Nakajima, K., 2011. Physica D 240, 13701377], the authors introduced the duality between values (words) and orderings (permutations) as a basis to discuss the relationship between information theoretic measures for finite-alphabet stationary stochastic processes and their permutation analogues. It has been used to give a simple proof of the equality between the entropy rate a...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Applied Mathematics and Computation
سال: 2002
ISSN: 0096-3003
DOI: 10.1016/s0096-3003(01)00199-0